Example: Let the input string be “i like this program very much”. The function should change the string to “much very program this like i”...
Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum....
Given a string str, find the length of the longest substring without repeating characters....
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. For example, if the given array is {100, 180, 260, 310, 40, 535, 695}, the maximum profit can earned by buying on day 0, selling on day 3. Again buy on day 4 and sell on day 6. If the given array of prices is sorted in decreasing order, then profit cannot be earned at all....
Given an unsorted array of nonnegative integers, find a continuous subarray which adds to a given number. Examples :...
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then the output should be 4....
Given an array and a value, find if there is a triplet in array whose sum is equal to the given value. If there is such a triplet present in array, then print the triplet and return true. Else return false....
Given a square matrix, turn it by 90 degrees in anti-clockwise direction without using any extra space.Examples :...
The atoi() function in C takes a string (which represents an integer) as an argument and returns its value of type int. So basically the function is used to convert a string argument to an integer....
Given an array A[] consisting 0s, 1s and 2s. The task is to write a function that sorts the given array. The functions should put all 0s first, then all 1s and all 2s in last.Examples:...
Given a square matrix, turn it by 90 degrees in anti-clockwise direction without using any extra space.Examples :...
Given an array that contains both positive and negative integers, find the product of the maximum product subarray. Expected Time complexity is O(n) and only O(1) extra space can be used....
